Generating generalized necklaces and new quasi-cyclic codes
نویسندگان
چکیده
منابع مشابه
Skew Generalized Quasi-cyclic Codes
This article discusses skew generalized quasi-cyclic codes over any finite field F with Galois automorphism θ. This is a generalization of quasi-cyclic codes and skew polynomial codes. These codes have an added advantage over quasi-cyclic codes since their lengths do not have to be multiples of the index. After a brief description of the skew polynomial ring F[x; θ], we show that a skew general...
متن کاملQuasi-cyclic codes over Z4 and some new binary codes
Recently, (linear) codes over and quasi-cyclic (QC) codes (over fields) have been shown to yield useful results in coding theory. Combining these two ideas we study -QC codes and obtain new binary codes using the usual Gray map. Among the new codes, the lift of the famous Golay code to produces a new binary code, a (92 2 28)-code, which is the best among all binary codes (linear or nonlinear). ...
متن کاملNew quasi-cyclic codes over F5
one of the most important problems of coding theory is to construct codes with beat possible minimum distances. In this paper, we use the algebraic structure of quasi-cyclic codes and the BCH type bound on the minimum distance to search for quasi-cyclic codes over IFS, the finite field with five elements, which improve the minimum distances of best-known linear codes. We construct 15 new linear...
متن کاملSix new binary quasi-cyclic codes
Six new quasi-cyclic codes are presented, which improve the lower bounds on the minimum distance for a binary code. A local exhaustive search is used to find these codes and many other quasi-cyclic codes which attain the lower bounds.
متن کاملStructure and performance of generalized quasi-cyclic codes
Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder Theorem yields a decomposition of GQC codes into a sum of concatenated codes. This decomposition leads to a trace formula, a minimum distance bound, and to a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications
سال: 2020
ISSN: 2148-838X
DOI: 10.13069/jacodesmath.784999